A novel autoassociative memory on the complex hypercubic lattice
نویسندگان
چکیده
In this paper we have defined a novel activation function called the multi-level signum for the real and complex valued associative memories. The major motivation of such a function is to increase the number of patterns that can be stored in a memory without increasing the number of neurons. The state of such a network can be described as one of the points that lie on a complex bounded lattice. The convergence behavior of such a network is observed which is supported with the simulation results performed on a sample dataset of 1000 instances
منابع مشابه
Brouwerian Autoassociative Morphological Memories and Their Relation to Traditional and Sparsely Connected Autoassociative Morphological Memories
Autoassociative morphological memories (AMM) are memory models that use operations of mathematical morphology for the storage and recall of pattern associations. These models can be very well de ned in a mathematical structure called complete lattice. In this paper, we introduce the Brouwerian autoassociative morphological memories (BAMMs) that are de ned on a complete Brouwerian lattice. The a...
متن کاملA Novel Lattice Associative Memory Based on Dendritic Computing
We present a novel hetero-associative memory based on dendritic neural computation. The computations in this model are based on lattice group operations. The proposed model does not suffer from the usual storage capacity problem and is extremely robust in the presence of various types of noise and data corruption.
متن کاملIsometric Collision Rules for the Four-Dimensional FCHC Lattice Gas
Collision rules are present ed for th e four-dimensional facecentered-hypercubic-lattice (FCHC) . The velocity set after collision is deduced from th e velocity set be fore collision by an isometry, chosen so as to preserve th e momentum and minimiz e the viscosity. A detailed implementation recipe is given. Th e shea r viscosity is camputed; th e result shows that essentially all memory of t h...
متن کاملRecursive enumeration of clusters in general dimension on hypercubic lattices.
A recursive method for enumerating clusters on a hypercubic lattice in d spatial dimensions is presented from which the weak embedding constants are determined as polynomials in d. A tabulation for all clusters having no free ends is available for nb≤15, where nb is the number of bonds. As illustrated here and elsewhere, this tabulation can be used to generate many series expansions. A novel me...
متن کاملDiffusion on a hypercubic lattice with pinning potential: exact results for the error-catastrophe problem in biological evolution
In the theoretical biology framework one fundamental problem is the so-called error catastrophe in Darwinian evolution models. We reexamine Eigen's fundamental equations by mapping them into a polymer depinning transition problem in a " genotype " space represented by a uni-tary hypercubic lattice {0, 1} d. The exact solution of the model shows that error catastrophe arises as a direct conseque...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008